Capturing incomplete information in resource allocation problems through numerical patterns

نویسندگان

  • Arun Marar
  • Warren B. Powell
چکیده

We look at the problem of optimizing complex operations with incomplete information where the missing information is revealed indirectly and imperfectly through historical decisions. Incomplete information is characterized by missing data elements governing operational behavior and unknown cost parameters. We assume some of this information may be indirectly captured in historical databases through flows characterizing resource movements. We can use these flows or other quantities derived from these flows as “numerical patterns” in our optimization model to reflect some of the incomplete information. Since regression trees represent probabilistic distributions of a numerical value specific to a vector of data elements known as a “state”, they drive our methodology for representing information in resource allocation models. We use a popular goodness-of-fit measure known as the Cramer-Von Mises metric based on the empirical distribution function (EDF) as the foundation of our approach. We then use a hybrid approach of solving a cost model with a term known as the “pattern metric” that minimizes the deviations of model decisions from observed quantities in a historical database. We see that when using this methodology, our problem of representing information pertaining to numerical patterns is combinatorial in the order statistics of the decision variables in the optimization model. We present a novel iterative method to solve this problem to get a stationary solution. Results with real-world data from a large freight railroad are presented.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design of a Bi-Objective Capacitated Single-Allocation Incomplete Hub Network Considering an Elastic Demand

This paper presents a bi-objective capacitated hub arc location problem with single assignment for designing a metro network with an elastic demand. In the literature, it is widely supposed that the network created with the hub nodes is complete. In this paper, this assumption is relaxed. Moreover, in most hub location problems, the demand is assumed to be static and independent of the location...

متن کامل

Motivation and resource-allocation for strategic alliances through the DeNovo perspective

In recent years, there are many theories and models such as transaction cost theory and the resource-based view have been proposed to explain the formation of strategic alliances. However, the perspectives are usually limited and incomplete. Additionally, the problem of resource allocation is also a serious issue when firms enter strategic alliances. The paper, here, proposes a holistic perspec...

متن کامل

An Interactive Approach for Multi-Attribute Resource Allocation in Grids

Auction-based models and protocols introduce money and pricing as the technique for coordination between users and producers of resources in grids. In this paper, we propose a multi-attribute reverse auction protocol to allocate grid resource. In order to enhance the information efficiency we develop a novel interactive approach supporting both user agents and producer agents. In this approach,...

متن کامل

Combining cost-based and rule-based knowledge in complex resource allocation problems

A major challenge in the formulation of optimization models for large-scale, complex operational problems is that some data are impossible or uneconomical to collect, producing a cost model that suffers from incomplete information. As a result, even an optimal solution may be “wrong” in the sense that it is solving the wrong problem. In many operational settings, knowledgeable experts will alre...

متن کامل

Efficient Optimization of Constrained Nonlinear Resource Allocations

We present an efficient method to optimize network resource allocations under nonlinear Quality of Service (QoS) constraints. We first propose a suite of generalized proportional allocation schemes that can be obtained by minimizing the information-theoretic function of relative entropy. We then optimize over the allocation parameters, which are usually design variables an engineer can directly...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • European Journal of Operational Research

دوره 197  شماره 

صفحات  -

تاریخ انتشار 2009